An efficient test vector compression scheme using selective Huffman coding
نویسندگان
چکیده
This paper presents a compression/decompression scheme based on selective Huffman coding for reducing the amount of test data that must be stored on a tester and transferred to each core in a system-on-a-chip (SOC) during manufacturing test. The test data bandwidth between the tester and the SOC is a bottleneck that can result in long test times when testing complex SOCs that contain many cores. In the proposed scheme, the test vectors for the SOC are stored in compressed form in the tester memory and transferred to the chip where they are decompressed and applied to the cores. A small amount of on-chip circuitry is used to decompress the test vectors. Given the set of test vectors for a core, a modified Huffman code is carefully selected so that it satisfies certain properties. These properties guarantee that the codewords can be decoded by a simple pipelined decoder (placed at the serial input of the core’s scan chain) that requires very small area. Results indicate that the proposed scheme can provide test data compression nearly equal to that of an optimum Huffman code with much less area overhead for the decoder.
منابع مشابه
Hybrid Algorithm for Lossless Image Compression using Simple Selective Scan order with Bit Plane Slicing
Problem statement: Identifying the new lossless image compression algorithm for high performance applications like medical and satellite imaging; a high quality lossless image is most important when reproduction which leads to classify the data for decision making. Approach: A new lossless hybrid algorithm based on simple selective scan order with Bit Plane Slicing method is presented for lossl...
متن کاملAnalysis of Don’t Care Bit Filling Techniques for Optimization of Compression and Scan Power
Test power and test time have been the major issues for current scenario of VLSI testing. The test data compression is the well known method used to reduce the test time. The don’t care bit filling method can be used for effective test data compression as well as reduction in scan power. In this paper we describe the algorithm for don’t care assignment like MT(Minimum Transition)-fill technique...
متن کاملImage Compression based on Quadtree and Polynomial
In this paper, an efficient image compression scheme is introduced, it is based on partitioning the image into blocks of variable sizes according to its locally changing image characteristics and then using the polynomial approximation to decompose image signal with less compressed information required compared to traditional predictive coding techniques, finally Huffman coding utilized to impr...
متن کاملHuffman-Based Test Response Coding
Test compression / decompression is an efficient method for reducing the test application cost. In this letter we propose a response compression method based on Huffman coding. The proposed method guarantees zero-aliasing and it is independent of the fault model and the structure of a circuit-under-test. Experimental results of the compression ratio and the size of the encoder for the proposed ...
متن کاملUniversal Deep Neural Network Compression
Compression of deep neural networks (DNNs) for memoryand computation-efficient compact feature representations becomes a critical problem particularly for deployment of DNNs on resource-limited platforms. In this paper, we investigate lossy compression of DNNs by weight quantization and lossless source coding for memory-efficient inference. Whereas the previous work addressed non-universal scal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 22 شماره
صفحات -
تاریخ انتشار 2003